Boyce-Codd normal form decomposition

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding Faithful Boyce-Codd Normal Form Decompositions

It is well known that faithful (i.e. dependency preserving) decompositions of relational database schemas into Boyce-Codd Normal Form (BCNF) do not always exist, depending on the set of functional dependencies given, and that the corresponding decision problem is NPhard. The only algorithm to guarantee both faithfulness and BCNF (if possible) proposed so far in [Os79] is a brute-force approach ...

متن کامل

Characterizations for Functional Dependency and Boyce-CODD Normal Form Families

A functional dependency (fd) family was recently defined [20] as the set of all instances satisfying some set of functional dependencies. A Royce-Codd normal form, abbreviated RCNF. family is defined here as an fd-family specified by some RCNF set of functi!)nal dependem& . The purpose of this paper is to present set-theoretic/algebraic characterizations relating to both types of families. Two ...

متن کامل

The Boyce-Codd-Heath Normal Form for SQL

In the relational model of data the Boyce-Codd-Heath normal form, commonly just known as Boyce-Codd normal form, guarantees the elimination of data redundancy in terms of functional dependencies. For efficient means of data processing the industry standard SQL permits partial data and duplicate rows of data to occur in database systems. Consequently, the combined class of uniqueness constraints...

متن کامل

Armstrong axioms and Boyce-Codd-Heath Normal Form under bag semantics

In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier's archiving and manuscript policies are encouraged to visit: a r t i c l e i n f o a b s t r a c t The theory of functional dependencies is based on relations, i.e. sets of tuples. Over...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 1997

ISSN: 0898-1221

DOI: 10.1016/s0898-1221(97)00001-1